Введите слово или словосочетание на любом языке 👆
Язык:
Перевод и анализ слов искусственным интеллектом ChatGPT
На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:
- как употребляется слово
- частота употребления
- используется оно чаще в устной или письменной речи
- варианты перевода слова
- примеры употребления (несколько фраз с переводом)
- этимология
Что (кто) такое priority scheduling - определение
Fixed priority pre-emptive scheduling; Fixed-priority scheduling
Найдено результатов: 277
priority scheduling
<operating system> Processes scheduling in which the
scheduler selects tasks to run based on their priority as
opposed to, say, a simple round-robin.
Priorities may be static or dynamic. Static priorities are
assigned at the time of creation, while dynamic priorities are
based on the processes' behaviour while in the system. For
example, the scheduler may favour I/O-intensive tasks so
that expensive requests can be issued as early as possible.
A danger of priority scheduling is starvation, in which
processes with lower priorities are not given the opportunity
to run. In order to avoid starvation, in preemptive
scheduling, the priority of a process is gradually reduced
while it is running. Eventually, the priority of the running
process will no longer be the highest, and the next process
will start running. This method is called aging.
Fixed-priority pre-emptive scheduling
Fixed-priority preemptive scheduling is a scheduling system commonly used in real-time systems. With fixed priority preemptive scheduling, the scheduler ensures that at any given time, the processor executes the highest priority task of all those tasks that are currently ready to execute.
Marcan priority
![[[Gottlob Christian Storr]]](https://commons.wikimedia.org/wiki/Special:FilePath/H Leibnitz - Theophil (Gottlob) Christian Storr (1844).jpg?width=200 "[[Gottlob Christian Storr]]")
![The [[two-source hypothesis]], one of several built upon Marcan priority, holds that a hypothetical document (the [[Q source]]) was also used as a source by Matthew and Luke independently.](https://commons.wikimedia.org/wiki/Special:FilePath/Synoptic Theory Mk-Q en.svg?width=200 "The [[two-source hypothesis]], one of several built upon Marcan priority, holds that a hypothetical document (the [[Q source]]) was also used as a source by Matthew and Luke independently.")
![Two-Gospel (Griesbach) theory]], an alternative to Marcan priority, holds that Mark used Matthew and Luke as sources.](https://commons.wikimedia.org/wiki/Special:FilePath/Synoptic Theory Mt-Lk en.svg?width=200 "Two-Gospel (Griesbach) theory]], an alternative to Marcan priority, holds that Mark used Matthew and Luke as sources.")
HYPOTHESIS THAT THE GOSPEL OF MARK WAS USED AS A SOURCE BY THE OTHER SYNOPTIC GOSPELS (MATTHEW AND LUKE)
Markan Priority; Marcan Priority; Markan priority; User:SlothMcCarty/Marcan priority
Marcan priority is the hypothesis that the Gospel of Mark was the first of the three synoptic gospels to be written, and was used as a source by the other two (Matthew and Luke). It is a central element in discussion of the synoptic problem; the question of the documentary relationship among these three gospels.
Priority signs
![Traditional Chinese]]](https://commons.wikimedia.org/wiki/Special:FilePath/Hong Kong Road Sign 102.svg?width=200 "Traditional Chinese]]")
![Swiss]] mountain postal road sign: priority given to public transport, such as postal bus (pay special attention to the specific three-tone-horn of the postal bus approaching hairpin bends and wait before the bend; traffic users must follow instructions given by public transport drivers)](https://commons.wikimedia.org/wiki/Special:FilePath/CH-Hinweissignal-Bergpoststrasse.svg?width=200 "Swiss]] mountain postal road sign: priority given to public transport, such as postal bus (pay special attention to the specific three-tone-horn of the postal bus approaching hairpin bends and wait before the bend; traffic users must follow instructions given by public transport drivers)")
![Filter in turn]] in the [[Channel Islands]], which indicates that traffic from different approaches has alternating priority at the junction.](https://commons.wikimedia.org/wiki/Special:FilePath/Filter in Turn Sign (Used in Jersey and Guernsey).svg?width=200 "Filter in turn]] in the [[Channel Islands]], which indicates that traffic from different approaches has alternating priority at the junction.")
SET OF ROAD TRAFFIC SIGNS SPECIFYING WHICH ROUTE HAS THE RIGHT OF WAY AT A PARTICULAR PLACE, GENERIC INFORMATION NOT SPECIFIC TO ANY REGION
Priority sign; Priority road
Priority traffic signs indicate the order in which vehicles should pass intersection points. Vehicles often come into conflict with other vehicles and pedestrians because their intended courses of travel intersect, and thus interfere with each other's routes.
Priority right
TIME-LIMITED RIGHT TRIGGERED BY THE FIRST FILING OF AN APPLICATION FOR A PATENT, INDUSTRIAL DESIGN OR TRADEMARK
Right of priority; Claims the priority; Claiming the priority; Multilateral priority right; Claim of priority; Bilateral priority right; Priority claim; Internal priority right; Internal priority; Priority year; Effective date of filing; Date of priority; Priority (patent); Priority rights; Priority document
In patent, industrial design rights and trademark laws, a priority right or right of priority is a time-limited right, triggered by the first filing of an application for a patent, an industrial design or a trademark respectively. The priority right allows the claimant to file a subsequent application in another country for the same invention, design, or trademark effective as of the date of filing the first application.
priority inheritance
ASPECT OF AN OPERATING SYSTEM
Priority donation
<parallel> A technique for avoiding priority inversion by
temporarily raising the prioriry of all processes that want to
access a shared resource to the highest priority level of any
of them. Priority inversion occurs where a low priority
process, L is holding a resource required by a high priority
process, H, but L is not running because a medium priority
process, M is running. Under priority inheritance, L
temporarily inherits H's priority, allowing L to run and
release the resource H is waiting for.
For example, an ambulance (H) is stuck behind a lorry (L)
waiting at a junction (the shared resource) for a gap in a
line of cars (M) using the junction. Applying priority
inheritance, the cars give way to the lorry as they would to
the ambulance, thus allowing the lorry and then the ambulance
to use the junction.
(2005-02-11)
Scheduling Open Service Interface Definition
AN OPEN KNOWLEDGE INITIATIVE SPECIFICATION; PROGRAMMATIC INTERFACES WHICH COMPRISE A SERVICE-ORIENTED ARCHITECTURE FOR DESIGNING AND BUILDING REUSABLE AND INTEROPERABLE SOFTWARE
Scheduling OSID
The Scheduling Open Service Interface Definition (OSID) is an Open Knowledge Initiative specification. OSIDs are programmatic interfaces which comprise a service-oriented architecture for designing and building reusable and interoperable software.
Priority inheritance
ASPECT OF AN OPERATING SYSTEM
Priority donation
In real-time computing, priority inheritance is a method for eliminating unbounded priority inversion. Using this programming method, a process scheduling algorithm increases the priority of a process (A) to the maximum priority of any other process waiting for any resource on which A has a resource lock (if it is higher than the original priority of A).
Rate monotonic scheduling
SCHEDULING TECHNIQUE IN OPERATING SYSTEMS
Rate Monotonic Scheduling; Static-priority scheduling class
<algorithm> A means of scheduling the time allocated to
periodic hard-deadline real-time users of a resource. The
users are assigned priorities such that a shorter fixed period
between deadlines is associated with a higher priority.
Rate monotonic scheduling provides a low-overhead, reasonably
resource-efficient means of guaranteeing that all users will
meet their deadlines provided that certain analytical
equations are satisfied during the system design. It avoids
the design complexity of time-line scheduling and the
overhead of dynamic approaches such as {earliest-deadline
scheduling}.
[D. R. Wilcox, Naval Ocean Systems Center Technical Report
1310, August 1989, "Periodic Phase Adjustment Distributed
Clock Synchronization in the Hard Realtime Environment",
p. 9 ].
(1996-03-23)
Rate-monotonic scheduling
SCHEDULING TECHNIQUE IN OPERATING SYSTEMS
Rate Monotonic Scheduling; Static-priority scheduling class
In computer science, rate-monotonic scheduling (RMS). is a priority assignment algorithm used in real-time operating systems (RTOS) with a static-priority scheduling class.
Википедия
Fixed-priority pre-emptive scheduling
Fixed-priority preemptive scheduling is a scheduling system commonly used in real-time systems. With fixed priority preemptive scheduling, the scheduler ensures that at any given time, the processor executes the highest priority task of all those tasks that are currently ready to execute.
The preemptive scheduler has a clock interrupt task that can provide the scheduler with options to switch after the task has had a given period to execute—the time slice. This scheduling system has the advantage of making sure no task hogs the processor for any time longer than the time slice. However, this scheduling scheme is vulnerable to process or thread lockout: since priority is given to higher-priority tasks, the lower-priority tasks could wait an indefinite amount of time. One common method of arbitrating this situation is aging, which gradually increments the priority of waiting processes and threads, ensuring that they will all eventually execute. Most real-time operating systems (RTOSs) have preemptive schedulers. Also turning off time slicing effectively gives you the non-preemptive RTOS.
Preemptive scheduling is often differentiated with cooperative scheduling, in which a task can run continuously from start to end without being preempted by other tasks. To have a task switch, the task must explicitly call the scheduler. Cooperative scheduling is used in a few RTOS such as Salvo or TinyOS.
